An Efficient Rateless Scheme Based on the Extendibility of Systematic Polar Codes
نویسندگان
چکیده
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملAn Efficient Secure Channel Coding Scheme based on Polar Codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملRateless Codes Design Scheme Based on Two Stages
Current rateless codes coding schemes ignored the order recovery of packets. To cope with this problem, average delay and maximum memory consumption were proposed as performance indices to characterize the order recovery performance, then a coding scheme based on two stages coding was proposed to improve the order recovery performance. Encoding of the front k coded symbols is the first stage, w...
متن کاملRandom access protocols based on rateless codes
We present two coded random access protocols that rely on the ideas of rateless codes and Successive Interference Cancellation (SIC). The rateless aspect is seen in that the contention period continues until the Base Station (BS) decides that a sufficient fraction of users has been resolved. The first protocol is referred to as frameless ALOHA, in which a device transmits the packet multiple ti...
متن کاملan Efficient Blind Signature Scheme based on Error Correcting Codes
Cryptography based on the theory of error correcting codes and lattices has received a wide attention in the last years. Shor’s algorithm showed that in a world where quantum computers are assumed to exist, number theoretic cryptosystems are insecure. Therefore, it is important to design suitable, provably secure post-quantum signature schemes. Code-based public key cryptography has the charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2762363